On Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays

نویسندگان

  • Anatol Slissenko
  • Joëlle Cohen
چکیده

We define a notion of implementation for real-time Abstract State Machines (ASM) with instantaneous actions by machines with delayed actions. The time is continuous, and time constraints are metric. It is clear that not every machine of the first type can be implemented by a machine of the second type. We describe sufficient conditions on ASM that permit to construct such an implementation in a rather straightforward way. The problem of properties preservation, when implementing ASM within this framework, is also briefly discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

In Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays

We define a notion of implementation for real-time Abstract State Machines (ASM) with instantaneous actions by machines with delayed actions. The time is continuous, and time constraints are metric. It is clear that not every machine of the first type can be implemented by a machine of the second type. We describe sufficient conditions on ASM that permit to construct such an implementation in a...

متن کامل

Implementation of Timed Abstract State Machines with Instantaneous Actions by Machines with Delays

We define an implementation of real-time reactive Abstract State Machines (ASMs) with instantaneous actions by ASMs with delayed actions. The time is continuous, and time constraints are metric, more concretely, defined by linear inequalities. It is clear that not every machine of the first type can be implemented by a machine of the second type. Because of the delays the runs of the initial ma...

متن کامل

Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking

We describe a prototype of a simulator for reactive timed abstract state machines (ASM) that checks whether the generated runs verify a requirements specification represented as a formula of a First Order Timed Logic (FOTL). The simulator deals with ASM with continuous or discrete time. The time constraints are linear inequalities. It can treat two semantics, one with instantaneous actions and ...

متن کامل

The Timed Abstract State Machine Language: Abstract State Machines for Real-Time System Engineering

In this paper, we present the Timed Abstract State Machine (TASM) language, which is a language for the specification of embedded real-time systems. In the engineering of embedded real-time systems, the correctness of the system is defined in terms of three aspects function, time, and resource consumption. The goal of the TASM language and its associated toolset is to provide a basis for specif...

متن کامل

A Quick Look At

State Machine Tools For more than 15 years, abstract state machines have been studied, practiced, and applied in modeling and specification of systems to bridge the gap between formal and pragmatic approaches. ASMs have become a well-known technique and assumed a major role in providing a solid and flexible mathematical framework for specification and modeling of virtually all kinds of discrete...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005